Exploring Pianist Performance Styles with Evolutionary String Matching

نویسندگان

  • Søren Tjagvad Madsen
  • Gerhard Widmer
چکیده

We propose novel machine learning methods for exploring the domain of music performance praxis. Based on simple measurements of timing and intensity in 12 recordings of a Schubert piano piece, short performance sequences are fed into a SOM algorithm in order to calculate ‘performance archetypes’. The archetypes are labeled with letters and approximate string matching done by an evolutionary algorithm is applied to find similarities in the performances represented by these letters. We present a way of measuring each pianist’s habit of playing similar phrases in similar ways and propose a ranking of the performers based on that. Finally, an experiment revealing common expression patterns is briefly described.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exploring Similarities in Music Performances with an Evolutionary Algorithm

The paper presents a novel approach to exploring similarities in music performances. Based on simple measurements of timing and intensity in 12 recordings of a Schubert piano piece, short ‘performance archetypes’ are calculated using a SOM algorithm and labelled with letters. Approximate string matching done by an evolutionary algorithm is applied to find similarities in the performances repres...

متن کامل

انتخاب کوچکترین ابر رشته در DNA با استفاده از الگوریتم ازدحام ذرّات

A DNA string can be supposed a very long string on alphabet with 4 letters. Numerous scientists attempt in decoding of this string. since this string is very long , a shorter section of it that have overlapping on each other will be decoded .There is no information for the right position of these sections on main DNA string. It seems that the shortest string (substring of the main DNA string) i...

متن کامل

A Comparative Study on String Matching Algorithm of Biological Sequences

String matching algorithm plays the vital role in the Computational Biology. The functional and structural relationship of the biological sequence is determined by similarities on that sequence. For that, the researcher is supposed to aware of similarities on the biological sequences. Pursuing of similarity among biological sequences is an important research area of that can bring insight into ...

متن کامل

Template-based Writer-independent Online Character Recognition System using Elastic Matching

A writer independent handwriting recognition system must be able to recognize a wide variety of handwriting styles, while attempting to obtain a high degree of recognition accuracy. As the number of writing styles increases, so does the variability of data distribution. We describe here a template-based system using a string matching distance measure of linear time complexity for the recognitio...

متن کامل

Comparing Various Parallelizing Approaches for Tribology

Different parallelization methods vary in their system requirements, programming styles, efficiency of exploring parallelism, and the application characteristics they can handle. For different situations, they can exhibit totally different performance gains. This paper compares OpenMP, MPI, and Strings for parallelizing a complicated tribology problem. The problem size and computing infrastruct...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • International Journal on Artificial Intelligence Tools

دوره 15  شماره 

صفحات  -

تاریخ انتشار 2006